EVPI-based importance sampling solution proceduresfor multistage stochastic linear programmeson parallel MIMD architectures
نویسندگان
چکیده
Multistage stochastic linear programming has many practical applications for problems whose current decisions have to be made under future uncertainty. There are a variety of methods for solving the deterministic equivalent forms of these dynamic problems, including the simplex and interior point methods and nested Benders decomposition { which decomposes the original problem into a set of smaller linear programming problems and has recently been shown to be superior to the alternatives for large problems. The Benders subproblems can be visualised as being attached to the nodes of a tree which is formed from the realisations of the random data vectors determining the uncertainty in the problem. Parallel versions of the nested Benders algorithm involve two obvious techniques for parallelising the associated tree structure for multiprocessors or multicomputers { subtree parallelisation or a nodal parallelisation { both of which utilise a farming approach. The nodal parallelisation technique is presented in this paper, as it balances load more e ciently than its alternative. Di ering structures of the test problems cause di ering levels of speed{up on a variety of multicomputing platforms: problems with few variables and constraints per node do not gain from this parallelisation. Stage aggregation has been successfully employed for such problems to improve their parallel solution e ciency by increasing the size of the nodes and therefore the time spent calculating relative to the time spent communicating between processors. A parallel version of an importance sampling solution algorithm based on local EVPI information has been developed for extremely large multistage stochastic linear programmes which either have too many data paths to solve directly or a continuous distribution of possible realisations. It utilises the parallel nested Benders algorithm and a parallel version of an algorithm designed to calculate the local EVPI values for the nodes of the tree and achieves near linear speed{up.
منابع مشابه
Sequential Importance Sampling Algorithms for Dynamic Stochastic Programming
This paper gives a comprehensive treatment of EVPI-based sequential importance sampling algorithms for dynamic (multistage) stochastic programming problems. Both theory and computational algorithms are discussed. Under general assumptions it is shown that both expected value of perfect information (EVPI) processes and the marginal EVPI process (the supremum norm of the conditional expectation o...
متن کاملParallelization and aggregation ofnested Benders decomposition
Dynamic multistage stochastic linear programming has many practical applications for problems whose current decisions have to be made under future uncertainty. There are a variety of methods for solving these problems, including nested Benders decomposition. In this method, recently shown to be superior to the alternatives for large problems, the problem is decomposed into a set of smaller line...
متن کاملStopping Rules for a Class of Sampling-Based Stochastic Programming Algorithms
Decomposition and Monte Carlo sampling-based algorithms hold much promise for solving stochastic programs with many scenarios. A critical component of such algorithms is a stopping criterion to ensure the quality of the solution. In this paper, we develop a stopping rule theory for a class of algorithms that estimate bounds on the optimal objective function value by sampling. We provide rules f...
متن کاملMultistage stochastic convex programs: Duality and its implications
In this paper, we study alternative primal and dual formulations of multistage stochastic convex programs (SP). The alternative dual problems which can be traced to the alternative primal representations, lead to stochastic analogs of standard deterministic constructs such as conjugate functions and Lagrangians. One of the by-products of this approach is that the development does not depend on ...
متن کاملParallel Algorithms for Fractal Image Coding on Mimd Architectures
In this paper parallel algorithms for fractal image coding on MIMD architectures are introduced and discussed. It turns out that the crucial point for the choice of a suitable parallelization strategy is the memory capacity of a processor element. Experimental results show a linear speedup of the proposed algorithms.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Annals OR
دوره 90 شماره
صفحات -
تاریخ انتشار 1999